On multi-partition communication complexity
نویسندگان
چکیده
منابع مشابه
Partition Arguments in Multiparty Communication Complexity
Consider the “Number in Hand” multiparty communication complexity model, where k players holding inputs x1, . . . , xk ∈ {0, 1} communicate to compute the value f(x1, . . . , xk) of a function f known to all of them. The main lower bound technique for the communication complexity of such problems is that of partition arguments: partition the k players into two disjoint sets of players and find ...
متن کاملAlmost quadratic gap between partition complexity and query/communication complexity
We show nearly quadratic separations between two pairs of complexity measures: • We show that there is a Boolean function f with D(f) = Ω((Dsc(f))2−o(1)) where D(f) is the deterministic query complexity of f and D is the subcube partition complexity of f ; • As a consequence, we obtain that there is f(x, y) such that D(f) = Ω(log2−o(1) χ(f)) where D(f) is the deterministic 2-party communication...
متن کاملCommunication Complexity of Multi-robot Systems
We examine the scalability of multi-robot algorithms. In particular, we attempt to capture the idea that the less coordination a multi-robot system requires, the better it should scale to large numbers of robots. To that end, we introduce a notion of communication complexity of multi-robot (or more generally, distributed control) systems as a surrogate for coordination. We describe a formalism,...
متن کاملA quadratically tight partition bound for classical communication complexity and query complexity
In this work we introduce, both for classical communication complexity and query complexity, a modification of the partition bound introduced by Jain and Klauck [JK10]. We call it the public-coin partition bound. We show that (the logarithm to the base two of) its communication complexity and query complexity versions form, for all relations, a quadratically tight lower bound on the public-coin...
متن کاملCapture Complexity by Partition
We show in this paper a special extended logic, partition logic based on so called partition quantifiers, is able to capture some important complexity classes NP, P and NL by its natural fragments. The Fagin’s Theorem and Immerman-Vardi’s Theorem are rephrased and strengthened into a uniform partition logic setting. Also the dual operators for the partition quantifiers are introduced to expose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2004
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.05.002